Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities
نویسندگان
چکیده
منابع مشابه
Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation
This is the rst of a series of two papers dedicated to eecient separation heuristics for violated inequalities in the context of solving to optimality instances of the Traveling Salesman Problem via branch-and-cut. In this paper we give the basic ideas behind these heuristics and design heuristics for comb separation. The second paper will deal with more complex inequalities such as Clique Tree...
متن کاملGeneralized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
We extend the work of Letchford [Letchford, A. N. 2000. Separating a superclass of comb inequalities in planar graphs. Math. Oper. Res. 25 443–454] by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints. Just as Letchford’s domino-parity constraints generalize comb inequalities, GDP constraints generalize the m...
متن کاملLifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem
We investigate the family of facet defining inequalities for the asymmetric traveling salesman (ATS) polytope obtainable by lifting the cycle inequalities. We establish several properties of this family that earmark it as the most important among the asymmetric inequalities for the ATS polytope known to date: (i) The family is shown to contain members of unbounded Chvatal rank, whereas most kno...
متن کاملImplementing Domino-Parity Inequalities for the Traveling Salesman Problem
We describe an implementation of Letchford’s domino-parity inequalities for the (symmetric) traveling salesman problem. The implementation includes pruning methods to restrict the search for dominoes, a parallelization of the main domino-building step, heuristics to obtain planar-support graphs, a set of safe-shrinking routines, a random-walk heuristic to extract additional violated constraints...
متن کاملComputing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)
W describe methods for implementing separation algorithms for domino-parity inequalities for the symmetric traveling salesman problem. These inequalities were introduced by Letchford (2000), who showed that the separation problem can be solved in polynomial time when the support graph of the LP solution is planar. In our study we deal with the problem of how to use this algorithm in the general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 92 شماره
صفحات -
تاریخ انتشار 2002